Automatic Design of Ant Algorithms with Grammatical Evolution
نویسندگان
چکیده
We propose a Grammatical Evolution approach to the automatic design of Ant Colony Optimization algorithms. The grammar adopted by this framework has the ability to guide the learning of novel architectures, by rearranging components regularly found on human designed variants. Results obtained with several TSP instances show that the evolved algorithmic strategies are effective, exhibit a good generalization capability and are competitive with human designed variants.
منابع مشابه
Grammar based function definition in Grammatical Evolution
We describe the use of grammars as an approach to automatic function definition in Grammatical Evolution. The automatic generation of functions allows the evolution of both the function and the code belonging to the main body of the program which has the ability to call upon the evolving function. As proof of concept we apply a grammar using automatic function definition to the Santa Fe ant tra...
متن کاملFrom Grammars to Parameters: Automatic Iterated Greedy Design for the Permutation Flow-Shop Problem with Weighted Tardiness
Recent advances in automatic algorithm configuration have made it possible to configure very flexible algorithmic frameworks in order to fine-tune them for particular problems. This is often done by the use of automatic methods to set the values of algorithm parameters. A rather different approach uses grammatical evolution, where the possible algorithms are implicitly defined by a context-free...
متن کاملA Comparative Study of Genetic Programming and Grammatical Evolution for Evolving Data Structures
The research presented in the paper forms part of a larger initiative aimed at automatic algorithm induction using machine learning. This paper compares the performance of two machine learning techniques, namely, genetic programming and a variation of genetic programming, grammatical evolution, for automatic algorithm induction. The application domain used to evaluate both the approaches is the...
متن کاملANT COLONY ALGORITHMS FOR NONLINEAR ANALYSIS AND OPTIMAL DESIGN OF STRUCTURES
In this paper nonlinear analysis of structures are performed considering material and geometric nonlinearity using force method and energy concepts. For this purpose, the complementary energy of the structure is minimized using ant colony algorithms. Considering the energy term next to the weight of the structure, optimal design of structures is performed. The first part of this paper contains ...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کامل